Torpid Mixing of Simulated Tempering on the Potts Model by Bhatnagar and Randall
نویسندگان
چکیده
I. Abstract and Intro The purpose of this paper is two fold. First, it proves that temperature-based sampling algorithms (specifically simulated tempering and swapping), which have successfully been used to sample bimodal distributions such as the low-temperature mean-field Ising model, can fail to converge rapidly on the more general Potts model. This is due to the nature of the phase change with three states or greater. Secondly, it presents a variant of the swapping algorithm, the Flat-Swap algorithm, and proves that it is rapidly mixing for any bimodal mean-field model.
منابع مشابه
Conditions for Torpid Mixing of Parallel and Simulated Tempering on Multimodal Distributions
We obtain upper bounds on the convergence rates of Markov chains constructed by parallel and simulated tempering. These bounds are used to provide a set of sufficient conditions for torpid mixing of both techniques. We apply these conditions to show torpid mixing of parallel and simulated tempering for three examples: a normal mixture model with unequal covariances in RM and the mean-field Pott...
متن کاملSufficient Conditions for Torpid Mixing of Parallel and Simulated Tempering
We obtain upper bounds on the spectral gap of Markov chains constructed by parallel and simulated tempering, and provide a set of sufficient conditions for torpid mixing of both techniques. Combined with the results of [22], these results yield a two-sided bound on the spectral gap of these algorithms. We identify a persistence property of the target distribution, and show that it can lead unex...
متن کاملSimulated Tempering and Swapping on Mean-Field Models
Simulated and parallel tempering are families of Markov Chain Monte Carlo algorithms where a temperature parameter is varied during the simulation to overcome bottlenecks to convergence due to multimodality. In this work we introduce and analyze the convergence for a set of new tempering distributions which we call entropy dampening. For asymmetric exponential distributions and the mean field I...
متن کاملTorpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics
We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangular subsets of the hypercubic lattice Z. We prove that under certain circumstances, the mixing time in a box of side length L with periodic boundary conditions can be exponential in L. In other words, under these circumstances, the mixing in these widely used algorithms is not rapid; instead, it is...
متن کاملConditions for Rapid Mixing of Parallel and Simulated Tempering on Multimodal Distributions by Dawn
We give conditions under which a Markov chain constructed via parallel or simulated tempering is guaranteed to be rapidly mixing, which are applicable to a wide range of multimodal distributions arising in Bayesian statistical inference and statistical mechanics. We provide lower bounds on the spectral gaps of parallel and simulated tempering. These bounds imply a single set of sufficient condi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014